A Combinatorial Double Auction for Community Shared Distributed Energy Resources
نویسندگان
چکیده
The integration of distributed energy resources (DERs), such as renewable (RE) and storage systems, can have many environmental economic benefits. sharing medium-scale DERs enhance these benefits by ensuring efficient resource utilisation promote economy economies scale opportunities. In this paper, we design a combinatorial double auction (CDA) for DER between multiple providers community consumers. proposed market addresses the complementarity services supports environmentally sustainable behaviour purpose is to allocate limited efficiently without compromising privacy or comfort First, bidding rules are designed social welfare optimisation problem formulated. Then, utility maximising strategies consumers with both objectives proposed. Additionally, three types introduced, their revenue investigated. A case study real world RE generation demand data from UK presented. Simulation results show that CDA greatly reduce emissions (by 24%) while also enhancing revenues providers, gains up 82%, when compared where sold through k -double auction.
منابع مشابه
Truthful Combinatorial Double Auction For Combinatorial Exchanges
First-come-first-serve (FCFS) scheme is used for selling the goods in market that is a multi-million dollar industry for any popular event. But in a competitive environment is this FCFS efficient? In earlier literature it has been shown that the auction based alternative solutions using the framework of mechanism design, a sub field of game theory [18] can provide better results against FCFS in...
متن کاملMultiagent Coordination Using a Distributed Combinatorial Auction
C AUCTIONS are a great way to represent and solve distributed allocation problems. Unfortunately, most of the winner determination solutions that exists are centralized. They require all agents to send their bids to a centralized auctioneer who then determines the winners. The PAUSE auction, in contrast, is an increasing-price combinatorial auction in which the problem of winner determination i...
متن کاملApproximate Bidding Algorithms for a Distributed Combinatorial Auction (Short Paper)
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions (CAs). However, most of the existing winner determination algorithms (WDAs) for CAs are centralized. The PAUSE auction is one of a few efforts to release the auctioneer from having to do all the work. The pausebid bidding algorithm[6] generates myopically-optimal bids for agents in a PAUSE a...
متن کاملApproximate bidding algorithms for a distributed combinatorial auction
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions (CAs). However, most of the existing winner determination algorithms (WDAs) for CAs are centralized. The PAUSE auction is one of a few efforts to release the auctioneer from having to do all the work. The pausebid bidding algorithm[6] generates myopically-optimal bids for agents in a PAUSE a...
متن کاملOn bidding algorithms for a distributed combinatorial auction
Combinatorial auctions (CAs) are a great way to solve complex resource allocation and coordination problems. However, CAs require a central auctioneer who receives the bids and solves the winner determination problem, an NP-hard problem. Unfortunately, a centralized auction is not a good fit for real world situations where the participants have proprietary interests that they wish to remain pri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2023
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2023.3260022